Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming
نویسندگان
چکیده
منابع مشابه
On the Asymptotic Average Number of Efficient Vertices in Multiple Objective Linear Programming
Let a1 , ..., am , c1 , ..., ck be independent random points in R that are identically distributed spherically symmetrical in R and let X :=[x # R|ai x 1, i=1, ..., m] be the associated random polyhedron for m n 2. We consider multiple objective linear programming problems maxx # X c1 x, maxx # X c T 2 x, ..., maxx # X c T k x with 1 k n. For distributions with algebraically decreasing tail in ...
متن کاملA necessary condition for multiple objective fractional programming
In this paper, we establish a proof for a necessary condition for multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we present the related semi parametric model.
متن کاملComputing efficient solutions to fuzzy multiple objective linear programming problems
In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...
متن کاملBiconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
We formulate the problem of optimizing a convex function over the weakly e$cient set of a multicriteria a$ne fractional program as a special biconvex problem. We propose a decomposition algorithm for solving the latter problem. The proposed algorithm is a branch-and-bound procedure taking into account the a$ne fractionality of the criterion functions. c © 2001 Published by Elsevier Science B.V.
متن کاملSENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1985
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.31.2.240